| 1. | The smaller the value of the merit function is , the closer the iteration point is to the solution
当价值函数的值越小时，迭代点越靠近最优解。 |
| 2. | Moreover , the solution of the qp problem provides a descent direction for most merit functions
另一方面，此时qp子问题的解是许多效益函数的下降方向。 |
| 3. | With merit function , the origin problem can be conformed to unconstrained or constrained minimization problems
利用merit函数的极小化变形可分为无约束和约束两种类型。 |
| 4. | Based on the optimality conditions and complementarity conditions for socp , a new merit function is defined in the algorithm
基于二次锥规划的最优性条件和互补条件，定义了一个新的价值函数。 |
| 5. | The principle of this method is presented and the effects of merit functions on fast identification of plasma boundary are given
介绍了该模型的基本原理，并重点研究了目标函数的选择对快速识别等离子体边界的影响。 |
| 6. | Secondly , a series of merit functions is established , and a sequence of parameters which converges to optimal value from arbitrary real number is found
再是构造了一系列评价函数，找到了从任意初始值直接收敛到最优值的参数序列。 |
| 7. | The resulted smooth merit function is convex and its optimal conditions contain a set of extra parameters , compared with the usual perturbed complementarity conditions
与一般内点法中的摄动互补条件相比，其最优性条件含有一组中心化参数。 |
| 8. | In chapter 2 , we discuss the method for solving nonlinear complementarity problems with the equivalent formulation of minimization based on merit function
第二章，我们集中讨论了原始的非线性互补问题在经过merit函数的极小化变形之后的解决方法。 |
| 9. | The basic idea is to find iterative points which converge to optimal point and its corresponding objective function or merit function values converge to optimal value
其基本思想是构造迭代点来逐步逼近最优点，相应的目标函数值或评价函数值逼近最优值。 |
| 10. | A practical way to overcome this difficulty is to use the so - called " natural level function " as the merit function instead of the general level function
此时newton方向是自然水平函数的最速下降方向。因此，利用自然水平函数进行搜索，可以增大算法的步长，达到提高算法效率的目的。 |
